Minimax estimations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimax Pathology and Real-Number Minimax Model

Game-playing programs usually evaluate moves by searching the game tree using the minimax principle. Practice shows that deeper searches produce better results. However, theoretical analyses indicate that under apparently reasonable conditions, the behavior of minimax is pathological, i.e. deeper searches produce worse results. In this paper, a minimax model that – unlike most work in this area...

متن کامل

Empirical Entropy, Minimax Regret and Minimax Risk

We consider the random design regression with square loss. We propose a method that aggregates empirical minimizers (ERM) over appropriately chosen random subsets and reduces to ERM in the extreme case, and we establish exact oracle inequalities for its risk. We show that, under the −p growth of the empirical -entropy, the excess risk of the proposed method attains the rate n− 2 2+p for p ∈ (0,...

متن کامل

Minimax Embeddings

Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfuctions of a quadratic form generated from the graph. We introduce a more general and more robust formulation of NLDR based on the singular value decomposition (SVD). In this framework, most spectral NLDR principles can be recovered by taking a subset of the constraints in ...

متن کامل

Minimax Probability

When constructing a classiier, the probability of correct classii-cation of future data points should be maximized. In the current paper this desideratum is translated in a very direct way into an optimization problem, which is solved using methods from convex optimization. We also show how to exploit Mercer kernels in this setting to obtain nonlinear decision boundaries. A worst-case bound on ...

متن کامل

Minimax Theorems

We suppose that X and Y are nonempty sets and f : X × Y → R. A minimax theorem is a theorem that asserts that, under certain conditions , inf Y sup X f = sup X inf Y f, that is to say, inf y∈Y sup x∈X f (x, y) = sup x∈X inf y∈Y f (x, y). The purpose of this article is to give the reader the flavor of the different kind of mini-max theorems, and of the techniques that have been used to prove the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Mathematical Statistics

سال: 1952

ISSN: 0007-4993

DOI: 10.5109/12957